Efficient Local Planning using Connection Collision Query
نویسندگان
چکیده
We introduce a novel proximity query, called connection collision query (CCQ), and use it for efficient and exact local planning in sampling-based motion planners. Given two collision-free configurations, CCQ checks whether these configurations can be connected by a given continuous path that either lies completely in the free space or penetrates any obstacle by at most ε , a given threshold. Our approach is general, robust, and can handle different continuous path formulations. We have integrated the CCQ algorithm with sampling-based motion planners and can perform reliable local planning queries with little performance degradation, as compared to prior methods. Moreover, the CCQ-based exact local planner is about an order of magnitude faster than prior exact local planning algorithms.
منابع مشابه
CCQ: Efficient Local Planning Using Connection Collision Query
We introduce a novel proximity query, called connection collision query (CCQ), and use it for efficient and exact local planning in sampling-based motion planners. Given two collision-free configurations, CCQ checks whether these configurations can be connected by a given continuous path that either lies completely in the free space or penetrates any obstacle by at most ε , a given threshold. O...
متن کاملA Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the two input query configurations to explore as little space as possible; (2) bi-directional i.e., it searches the robot’s free space by concurrently building a roadmap made of two trees rooted at the query configurations –...
متن کاملFast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing
We present a novel approach to perform fast probabilistic collision checking in high-dimensional configuration spaces to accelerate the performance of sampling-based motion planning. Our formulation stores the results of prior collision queries, and then uses such information to predict the collision probability for a new configuration sample. In particular, we perform an approximate k-NN (k-ne...
متن کاملOn Delaying Collision Checking in PRM Planning – Application to Multi-Robot Coordination
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: single-query – instead of pre-computing a roadmap covering the entire free space, it uses the two input query configurations to explore as little space as possible; bi-directional – it explores the robot’s free space by building a roadmap made of two trees rooted at the query configurations...
متن کاملCollision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
The complexity of nearest-neighbor search dominates the asymptotic running time of many sampling-based motion-planning algorithms. However, collision detection is often considered to be the computational bottleneck in practice. Examining various asymptotically optimal planning algorithms, we characterize settings, which we call NNsensitive, in which the practical computational role of nearest-n...
متن کامل